A characterization of P4-comparability graphs
نویسندگان
چکیده
A graph is a P4-comparability graph if it admits an acyclic orientation of its edges which is transitive on every chordless path on four vertices. We give a characterization of P4-comparability graphs in terms of an auxiliary graph being bipartite. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Parallel algorithms for P4-comparability graphs
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of such a graph. Sequential algorithms for these problems have been presented by Hoàng and Reed and very recently by Raschle and Simon, and by Nikolopoulos and Palios. In...
متن کاملRecognition and Orientation Algorithms for P4-Comparability Graphs
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of a P4-comparability graph. These problems have been considered by Hoàng and Reed who described O(n) and O(n)-time algorithms for their solution respectively, where n is...
متن کاملEven and Odd Pairs in Comparability and in P4-comparability Graphs
We characterize even and odd pairs in comparability and in P 4-comparability graphs. The characterizations lead to simple algorithms for deciding whether a given pair of vertices forms an even or odd pair in these classes of graphs. The complexities of the proposed algorithms are O(n + m) for comparability graphs and O(n 2 m) for P 4-comparability graphs. The former represents an improvement ov...
متن کاملOn the Recognition of P4-Comparability Graphs
We consider the problem of recognizing whether a simple undirected graph is a P4-comparability graph. This problem has been considered by Hoàng and Reed who described an O(n)-time algorithm for its solution, where n is the number of vertices of the given graph. Faster algorithms have recently been presented by Raschle and Simon and by Nikolopoulos and Palios; the time complexity of both algorit...
متن کاملOn P4-transversals of chordal graphs
A P4-transversal of a graph G is a set of vertices T which meets every P4 of G. A P4transversal T is called stable if there are no edges in the subgraph of G induced by T . It has been previously shown by Hoàng and Le that it is NP -complete to decide whether a comparability (and hence perfect) graph G has a stable P4-transversal. In the following we show that the problem is NP -complete for ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006